Computational Experience with the Reverse Search Vertex Enumeration Algorithm
نویسنده
چکیده
This paper describes computational experience obtained in the development of the lrs code, which uses the reverse search technique to solve the vertex enumeration/convex hull problem for d-dimensional convex polyhedra. We giv e empirical results showing improvements obtained by the use of lexicographic perturbation, lifting, and integer pivoting. We also give some indication of the cost of using extended precision arithmetic and illustrate the use of the estimation function of lrs. The empirical results are obtained by running various versions of the program on a set of well-known non-trivial polyhedra: cut, configuration, cyclic, Kuhn_Quandt, and metric polytopes. Ke ywords: vertex enumeration, convex hulls, reverse search, computational experience
منابع مشابه
lrs: A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm
This paper describes an improved implementation of the reverse search vertex enumeration/convex hull algorithm for d-dimensional convex polyhedra. The implementation uses a lexicographic ratio test to resolve degeneracy, works on bounded or unbounded polyhedra and uses exact arithmetic with all integer pivoting. It can also be used to compute the volume of the convex hull of a set of points. Fo...
متن کاملEstimating the number of vertices of a polyhedron
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P . The estimates are based on applying tree estimation methods to the reverse search technique. The time to generate an unbiased estimate is essentially bounded by the time taken to solve a linear program on P with the simplex method. Computational experience is reported. The met...
متن کاملA parallel framework for reverse search using mts
We describe mts, which is a generic framework for parallelizing certain types of tree search programs, that (a) provides a single common wrapper containing all of the parallelization, and (b) minimizes the changes needed to the existing single processor legacy code. The mts code was derived from ideas used to develop mplrs, a parallelization of the reverse search vertex enumeration code lrs. Th...
متن کاملmplrs: A scalable parallel vertex/facet enumeration code
We describe a new parallel implementation, mplrs, of the vertex enumeration code lrs that uses the MPI parallel environment and can be run on a network of computers. The implementation makes use of a C wrapper that essentially uses the existing lrs code with only minor modifications. mplrs was derived from the earlier parallel implementation plrs, written by G. Roumanis in C++. plrs uses the Bo...
متن کاملA Portable Parallel Implementation of the lrs Vertex Enumeration Code
We describe a parallel implementation of the vertex enumeration code lrs that automatically exploits available hardware on multi-core computers and runs on a wide range of platforms. The implementation makes use of a C++ wrapper that essentially uses the existing lrs code with only minor modifications. This allows the simultaneous development of the existing single processor code with the speed...
متن کامل